Heat Kernel Analysis of Syntactic Structures

نویسندگان

چکیده

We consider two different data sets of syntactic parameters and we discuss how to detect relations between through a heat kernel method developed by Belkin–Niyogi, which produces low dimensional representations the data, based on Laplace eigenfunctions, that preserve neighborhood information. analyze connectivity clustering structures arise in datasets, regions maximal variance two-parameter space Belkin–Niyogi construction, identify preferable choices independent variables. compute coefficients their variance.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Heat Kernel analysis of Syntactic Structures

We consider two different data sets of syntactic parameters and we discuss how to detect relations between parameters through a heat kernel method developed by Belkin–Niyogi, which produces low dimensional representations of the data, based on Laplace eigenfunctions, that preserve neighborhood information. We analyze the different connectivity and clustering structures that arise in the two dat...

متن کامل

Descending-Path Convolution Kernel for Syntactic Structures

Convolution tree kernels are an efficient and effective method for comparing syntactic structures in NLP methods. However, current kernel methods such as subset tree kernel and partial tree kernel understate the similarity of very similar tree structures. Although soft-matching approaches can improve the similarity scores, they are corpusdependent and match relaxations may be task-specific. We ...

متن کامل

Heat kernel analysis on graphs

In this thesis we aim to develop a framework for graph characterization by combining the methods from spectral graph theory and manifold learning theory. The algorithms are applied to graph clustering, graph matching and object recognition. Spectral graph theory has been widely applied in areas such as image recognition, image segmentation, motion tracking, image matching and etc. The heat kern...

متن کامل

Heat Kernel Analysis on Infinite-dimensional Groups

The paper gives an overview of our previous results concerning heat kernel measures in infinite dimensions. We give a history of the subject first, and then describe the construction of heat kernel measure for a class of infinite-dimensional groups. The main tool we use is the theory of stochastic differential equations in infinite dimensions. We provide examples of groups to which our results ...

متن کامل

Heat kernel coupling for multiple graph analysis

In this paper, we introduce heat kernel coupling (HKC) as a method of constructing multimodal spectral geometry on weighted graphs of different size without vertex-wise bijective correspondence. We show that Laplacian averaging can be derived as a limit case of HKC, and demonstrate its applications on several problems from the manifold learning and pattern recognition domain.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics in Computer Science

سال: 2021

ISSN: ['1661-8289', '1661-8270']

DOI: https://doi.org/10.1007/s11786-021-00498-0